Equivalence Checking for Partial Implementations Revisited
نویسندگان
چکیده
In this paper we consider the problem of checking whether a partial implementation can (still) be extended to a complete design which is equivalent to a given full specification. In particular, we investigate the relationship between the equivalence checking problem for partial implementations (PEC) and the validity problem for quantified Boolean formulae (QBF) with so-called Henkin quantifiers. Our analysis leads us to a sound and complete algorithmic solution to the PEC problem as well as to an exact complexity theoretical classification of the problem.
منابع مشابه
Equivalence Checking in the Presence of Incompletely Specified Boxes
We consider the problem of checking whether an implementation which contains parts with incomplete information is equivalent to a given full specification. We study implementations which are not completely specified, but contain boxes which are associated with incompletely specified functions (called Incompletely Specified Boxes or IS–Boxes). After motivating the use of implementations with Inc...
متن کاملRandomized Partial Checking Revisited
We study mix-nets with randomized partial checking (RPC) as proposed by Jakobsson, Juels, and Rivest (2002). RPC is a technique to verify the correctness of an execution both for Chaumian and homomorphic mix-nets. The idea is to relax the correctness and privacy requirements to achieve a more efficient mix-net. We identify serious issues in the original description of mix-nets with RPC and show...
متن کاملOn the Connection of Partial Order Logics and PartialOrder Reduction
We examine the connection between \equivalence robust" subsets of propositional temporal logics (LTL and CTL*), for which partial order reduction methods can be applied in model checking, and partial order logics and equivalences. For the linear case we show how to naturally translate \equivalence robust" LTL properties into Thiagarajan's linear time temporal logic for traces (TrPTL), substanti...
متن کاملPartial order reductions for model checking temporal epistemic logics over interleaved multi-agent systems
We investigate partial order reduction for model checking multiagent systems by focusing on interleaved interpreted systems. These are a particular class of interpreted systems, a mainstream MAS formalism, in which only one action at the time is performed. We present a notion of stuttering-equivalence, and prove the semantical equivalence of stuttering-equivalent traces with respect to linear a...
متن کاملSequential equivalence checking between system level and RTL descriptions
Sequential equivalence checking between system level descriptions of designs and their Register Transfer Level(RTL) implementations is a very challenging and important problem in the context of Systems on a Chip (SoCs). We propose a technique to alleviate the complexity of the equivalence checking problem, by efficiently decomposing it using compare points. Traditionally, equivalence checking t...
متن کامل